On the Expressiveness of MTL Variants over Dense Time
نویسندگان
چکیده
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relative expressiveness of the resulting MTL variants over dense time. We prove that the expressiveness is not affected by the variations when considering non-Zeno interpretations and arbitrary nesting of temporal operators. On the contrary, the expressiveness changes for flat (i.e., without nesting) formulas, or when Zeno interpretations are allowed.
منابع مشابه
On the Expressiveness of MTL with Past Operators
We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘SI ’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more expressive than the pointwise version. We also pro...
متن کاملOn the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded sig...
متن کاملAbstract List of Figures
Temporal Logics are a popular formalism for specification of properties in the verification of reactive systems. They can be employed to reason about the behavior of systems with the evolution of time. For example one can specify that an event corresponding to the request of a resource is eventually followed by an event corresponding to its grant. Linear-time Temporal Logic (LTL) is one such fo...
متن کاملOn the Decidability and Complexity of Some Fragments of Metric Temporal Logic
Metric Temporal Logic, MTL[UI , SI ], is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints I . In this paper, we sharpen the decidability results by showing that the satisfiability of MTL [ UI , SNS] (where NS denotes non-singular interva...
متن کاملOn the Expressiveness of TPTL and MTL over ω-Data Words
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007